Implications-as-Rules vs. Implications-as-Links: An Alternative Implication-Left Schema for the Sequent Calculus

نویسنده

  • Peter Schroeder-Heister
چکیده

The interpretation of implications as rules motivates a different left-introduction schema for implication in the sequent calculus, which is conceptually more basic than the implication-left schema proposed by Gentzen. Corresponding to results obtained for systems with higher-level rules, it enjoys the subformula property and cut elimination in a weak form. The introduction schema for implication on the left side of the turnstile in Gentzen’s sequent calculus for intuitionistic logic runs as follows: (→L) Γ⊢A ∆, B ⊢C Γ,∆, A→B ⊢C . With all other logical inference schemata it shares (among others) the following two properties: (I) The schema contains exactly one connective. (II) The connective occurs only in the conclusion of the schema, i.e. below the inference line, and there exactly once. ∗This paper was written during a research stay at IHPST Paris supported by the Fondation Maison des Sciences de l’Homme, by the ESF research project “Dialogical Foundations of Semantics (DiFoS)” within the ESF-EUROCORES programme “LogICCC — Modelling Intelligent Interaction” (DFG Schr 275/15-1) and the French-German DFG-ANR project “Hypothetical Reasoning — Logical and Semantical Perspectives (HYPOTHESES)” (DFG Schr 275/16-1). I gratefully acknowledge the comments of participants of a seminar given at IHPST on the subject of this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implications, coimplications and left semi-uninorms on a complete lattice

In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...

متن کامل

Formalised Inductive Reasoning in the Logic of Bunched Implications

We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framework. The first proof system adopts a traditional approach to inductive proof, extending the usual sequent calculus for predicate BI with explicit induction rules for the inductively defined predicates. The second system...

متن کامل

The Inverse Method for the Logic of Bunched Implications

The inverse method, due to Maslov, is a forward theorem provingmethod for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic with multiplicative linear conjunction and its adjoint implication. We present the first formulation of an inver...

متن کامل

The depth of intuitionistic cut free proofs

We prove a quadratic upper bound for the depth of cut free proofs in propositional intuitionistic logic formalized with Gentzen’s sequent calculus. We discuss bounds on the necessary number of reuses of left implication rules. We exhibit an example showing that this quadratic bound is optimal. As a corollary, this gives a new proof that propositional validity for intuitionistic logic is in PSPACE.

متن کامل

Relating Sequent Calculi for Bi-intuitionistic Propositional Logic

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent calculi for bi-intuitionistic propositional logic: (1) a basic standard-style sequent calculus that restricts the premises of implication-right and exclusio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Philosophical Logic

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2011